Single Reduct Generation Based on Relative Indiscernibility of Rough Set Theory
نویسندگان
چکیده
In real world everything is an object which represents particular classes. Every object can be fully described by its attributes. Any real world dataset contains large number of attributes and objects. Classifiers give poor performance when these huge datasets are given as input to it for proper classification. So from these huge dataset most useful attributes need to be extracted that contribute the maximum to the decision. In the paper, attribute set is reduced by generating reducts using the indiscernibility relation of Rough Set Theory (RST). The method measures similarity among the attributes using relative indiscernibility relation and computes attribute similarity set. Then the set is minimized and an attribute similarity table is constructed from which attribute similar to maximum number of attributes is selected so that the resultant minimum set of selected attributes (called reduct) cover all attributes of the attribute similarity table. The method has been applied on glass dataset collected from the UCI repository and the classification accuracy is calculated by various classifiers. The result shows the efficiency of the proposed method.
منابع مشابه
Entropies Of Fuzzy Indiscernibility Relation And Its Operations
Yager’s entropy was proposed to compute the information of fuzzy indiscernibility relation. In this paper we present a novel interpretation of Yager’s entropy in discernibility power of a relation point of view. Then some basic definitions in Shannon’s information theory are generalized based on Yager’s entropy. We introduce joint entropy, conditional entropy, mutual information and relative en...
متن کاملCRST: A Generalization of Rough Set Theory
The paper presents a transition from the crisp rough set theory to a fuzzy one, called Alpha Rough Set Theory or, in short, a-RST. All basic concepts or rough set theory are extended, i.e., information system, indiscernibility, dependency, reduction, core, de®nability, approximations and boundary. The resulted theory takes into account fuzzy data and allows the approximation of fuzzy concepts. ...
متن کاملAn Evaluation Method of Relative Reducts Based on Roughness of Partitions
This paper focuses on rough set theory which provides mathematical foundations of set-theoretical approximation for concepts, as well as reasoning about data. Also presented in this paper is the concept of relative reducts which is one of the most important notions for rule generation based on rough set theory. In this paper, from the viewpoint of approximation, the authors introduce an evaluat...
متن کاملConstructing Minimal Spanning Tree Based on Rough Set Theory for Gene Selection
Microarray gene dataset often contains high dimensionalities which cause difficulty in clustering and classification. Datasets containing huge number of genes lead to increased complexity and therefore, degradation of dataset handling performance. Often, all the measured features of these high-dimensional datasets are not relevant for understanding the underlying phenomena of interest. Dimensio...
متن کاملPrunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory
RULE REDUCTS BASED ON ROUGH SET THEORY Şahin Emrah AMRAHOV Computer Engineering Department , Ankara University, Ankara, Turkey Fatih AYBAR Computer Engineering Department, Ankara University, Ankara, Turkey Serhat DOĞAN Economics Department, Bilkent University, Ankara, Turkey In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1203.3170 شماره
صفحات -
تاریخ انتشار 2012